Finite field arithmetic

Results: 53



#Item
11BRICS  Basic Research in Computer Science BRICS RSCramer & Damg˚ard: Zero-Knowledge Proofs for Finite Field Arithmetic  Zero-Knowledge Proofs for

BRICS Basic Research in Computer Science BRICS RSCramer & Damg˚ard: Zero-Knowledge Proofs for Finite Field Arithmetic Zero-Knowledge Proofs for

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 1997-11-26 08:42:39
    12Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR–  Nonnegative elements of Z:

    Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR– Nonnegative elements of Z:

    Add to Reading List

    Source URL: www.iacr.org

    Language: English - Date: 2009-09-22 18:54:06
    13Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on “Computer and Network Security” by Avi Kak () January 29, 2015

    Lecture 6: Finite Fields (PART 3) PART 3: Polynomial Arithmetic Theoretical Underpinnings of Modern Cryptography Lecture Notes on “Computer and Network Security” by Avi Kak () January 29, 2015

    Add to Reading List

    Source URL: engineering.purdue.edu

    Language: English - Date: 2015-01-29 15:31:09
    14Polynomial arithmetic and applications in number theory David Harvey September 26, 2008

    Polynomial arithmetic and applications in number theory David Harvey September 26, 2008

    Add to Reading List

    Source URL: web.maths.unsw.edu.au

    Language: English - Date: 2011-07-17 23:06:27
    15Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne

    Faster polynomial multiplication over finite fields David Harvey University of New South Wales 8th December AustMS/NZMS 2014, University of Melbourne

    Add to Reading List

    Source URL: web.maths.unsw.edu.au

    Language: English - Date: 2014-12-30 21:41:38
    16Efficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics Keisuke Hakuta1 , Hisayoshi Sato1 , and Tsuyoshi Takagi2 1  Hitachi, Ltd., Systems Development Laboratory,

    Efficient Arithmetic on Subfield Elliptic Curves over Small Odd Characteristics Keisuke Hakuta1 , Hisayoshi Sato1 , and Tsuyoshi Takagi2 1 Hitachi, Ltd., Systems Development Laboratory,

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2005-12-11 20:15:09
    17Universally Constructing 12-th Degree Extension Field for Ate Pairing Masaaki Shirase School of Systems Information, Future University Hakodate, 116-2 Kamedanakano, Hakodate, Hokkaido, Japan

    Universally Constructing 12-th Degree Extension Field for Ate Pairing Masaaki Shirase School of Systems Information, Future University Hakodate, 116-2 Kamedanakano, Hakodate, Hokkaido, Japan

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2010-02-18 23:01:15
    181  Square root computation over even extension fields Gora Adj 1

    1 Square root computation over even extension fields Gora Adj 1

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2013-07-18 17:22:53
    19COMBINATIONAL LOGIC DESIGN FOR AES SUBBYTE TRANSFORMATION ON MASKED DATA ELENA TRICHINA Abstract. Low power consumption, low gate count and high throughput used to be standard design criteria for cryptographic coprocesso

    COMBINATIONAL LOGIC DESIGN FOR AES SUBBYTE TRANSFORMATION ON MASKED DATA ELENA TRICHINA Abstract. Low power consumption, low gate count and high throughput used to be standard design criteria for cryptographic coprocesso

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2003-11-12 00:19:16
    20Privacy-Preserving Set Operations  Lea Kissner Dawn Song

    Privacy-Preserving Set Operations Lea Kissner Dawn Song

    Add to Reading List

    Source URL: www.cs.cmu.edu

    Language: English - Date: 2006-11-19 16:59:50